Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
نویسندگان
چکیده
منابع مشابه
Constructing Supersingular Elliptic Curves
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based c...
متن کاملMinimal Cm Liftings of Supersingular Elliptic Curves
In this paper, we give a ‘direct’ construction of the endomorphism ring of supersingular elliptic curves over a prime field Fp from ‘ideal classes’ of Q( √−p). We use the result to prove that the result of Kaneko on ‘minimal’ CM liftings of such supersingular elliptic curves is a best possible result. We also prove that the result of Elkies on ‘minimal’ CM liftings of all supersingular elliptic...
متن کاملExplicit isogeny descent on elliptic curves
In this note, we consider an `-isogeny descent on a pair of elliptic curves over Q. We assume that ` > 3 is a prime. The main result expresses the relevant Selmer groups as kernels of simple explicit maps between finitedimensional F`-vector spaces defined in terms of the splitting fields of the kernels of the two isogenies. We give examples of proving the `-part of the Birch and Swinnerton-Dyer...
متن کاملCM liftings of supersingular elliptic curves
Assuming GRH, we present an algorithm which inputs a prime p and outputs the set of fundamental discriminants D < 0 such that the reduction map modulo a prime above p from elliptic curves with CM by OD to supersingular elliptic curves in characteristic p. In the algorithm we first determine an explicit constant Dp so that |D| > Dp implies that the map is necessarily surjective and then we compu...
متن کاملHard and Easy Problems for Supersingular Isogeny Graphs
We consider the endomorphism ring computation problem for supersingular elliptic curves, constructive versions of Deuring’s correspondence, and the security of Charles-Goren-Lauter’s cryptographic hash function. We show that constructing Deuring’s correspondence is easy in one direction and equivalent to the endomorphism ring computation problem in the other direction. We also provide a collisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2021
ISSN: 1862-2984,1862-2976
DOI: 10.1515/jmc-2020-0029